Concurrency Control in B+-Trees Databases Using Preparatory Operations
نویسندگان
چکیده
A simple concurrency control mechanism for B+-trees Databases is introduced. It is based on early splitting and catenating of nodes during a process, which are candidates for such operations later on in that process. These early operations enable to lock only the current node in the process and its father node, and hence to increase the degree of concurrency relatively to other known mechanisms.
منابع مشابه
T -tree: Main Memory Index Structure with Concurrency Control and Recovery
While B+trees are the most popular index structure for disk databases, the T-Tree has been widely accepted as a promising index structure for main memory databases. For over two decades the speed of CPUs has increased faster than the speed of the main memory. Therefore, the speed gap of the CPU and memory has rapidly become steeper, and memory access has become the new bottleneck in databases. ...
متن کاملConcurrent B-trees with Lock-free Techniques
B-trees and their variants are efficient data structures for finding records in a large collection (e.g., databases). The efficiency of B-trees increases when a number of users can manipulate the tree simultaneously. Many algorithms have been developed over the last three decades to achieve both concurrency and consistency in B-trees. However, current lock-based concurrency-control techniques l...
متن کاملNew Concurrency Control Algorithms for Accessing and Compacting B-Trees
This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characterized by the use of variable-length indices, the employment of a single lock type for the usual access operations and preemptive splits as well as delayed catenations and subdivisions. We also introduce a new compaction ...
متن کاملOptimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems
In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...
متن کاملCombinational Approach for Object Clipping Using GLIP and Protection Against Sql Injection Attacks
Multidimensional databases are being used in a wide range of applications. To meet this fast-growing demand,R+ trees were used that exhibit outstanding search performance. In order to support efficient concurrent access in multiuser environments, concurrency control mechanisms for multidimensional indexing have been proposed. However, these mechanisms cannot be directly applied to the R+-tree b...
متن کامل